منابع مشابه
Graph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملGraph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کاملGraph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of inneighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind o...
متن کاملGraph isomorphism and QAP variances
Variances of solution values that can be calculated in polynomial time may be associated with an instance of the Quadratic Assignment Problem (QAP). The problem of graph isomorphism can be modeled as a QAP, associating each data matrix with each graph. In this work, we look for invariant edge weight functions for the graphs composing the instances in order to try to find quantitative difference...
متن کاملGraph isomorphism is polynomial
We show that the graph isomorphism problem is determined in a polynomial time. This is done by showing that that two graphs on n vertices are isomorphic if and only if a corresponding system of (4n− 1)n equations in n nonnegative variables is solvable. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90063-n